/*************************************************************************
 * File Name:    E.cc
 * Author:       zero91
 * Mail:         jianzhang9102@gmail.com
 * Created Time: Sat 12 Oct 2013 11:07:59 AM CST
 * 
 * Description:  
 ************************************************************************/

#include <iostream>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>

using namespace std;

int
main(int argc, char *argv[])
{
    std::ios_base::sync_with_stdio(false);

    char ch;
    string text = "";
    while (scanf("%c", &ch) != EOF) {
        text += ch;
    }

    bool del_pos[text.size()];
    memset(del_pos, false, sizeof(del_pos));

    stack<int> start_pos;

    for (size_t i = 0; i < text.size(); ++i) {
        if (text[i] == '/' && text[i + 1] == '*') {
            start_pos.push(i);
            ++i;
        } else if (text[i] == '*' && text[i + 1] == '/') {
            if (start_pos.size() > 0) {
                for (int j = start_pos.top(); j <= i + 1; ++j) {
                    del_pos[j] = true;
                }
                ++i;
                start_pos.pop();
            }
        }
    }

    string ans = "";
    for (size_t i = 0; i < text.size(); ++i) {
        if (del_pos[i]) continue;
        ans += text[i];
    }
    cout << "Case #1:\n" << ans;

    return 0;
}
